/**
 *  Copyright (C) 2013  Piotr Szczepa�ski
 *
 *   This program is free software: you can redistribute it and/or modify
 *   it under the terms of the GNU General Public License as published by
 *   the Free Software Foundation, either version 3 of the License, or
 *   (at your option) any later version.
 *
 *   This program is distributed in the hope that it will be useful,
 *   but WITHOUT ANY WARRANTY; without even the implied warranty of
 *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *   GNU General Public License for more details.
 *
 *   You should have received a copy of the GNU General Public License
 *   along with this program.  If not, see <http://www.gnu.org/licenses/>.
*/
package edu.pw.elka.gtsna.centrality;

import java.util.LinkedHashMap;
import java.util.Map;

import edu.pw.elka.gtsna.graph.Graph;

/**
 * @author Piotr Lech Szczepa�ski
 * @author P.Szczepanski@ii.pw.edu.pl 
 *
 */
abstract public class AbstractCentrality<T> {
	
	protected Graph graph;
	protected  Map<T, Double> centralities = new LinkedHashMap<T, Double>();
	
	public AbstractCentrality (Graph graph){
		this.graph = graph;
	}
	
	public double getCentrality (T element){
		return centralities.get(element);
	}	
	
	public Map<T, Double> getCentralities(){
		return centralities;
	}
	
	/**
	 * This function computes centralities for all nodes
	 */
	abstract public  void computeCentrality();

    public void printCentralities(){
        for(T element: centralities.keySet()){
            System.out.println(element+" "+centralities.get(element));
        }
    }

}
